A General Fixed Rate Arithmetic Coding Method for Constrained Channels

نویسندگان

  • Stephen Todd
  • Glen G. Langdon
  • G. Nigel Martin
چکیده

This paper extends the result of earlier work on the application of arithmetic codes to the constrained channel problem. We specifically present a general length-based $xed rate implementation technique which performs the arithmetic coding recursions during each channel time unit. This technique is superior to an earlier unpublished code for general constrained channels. The approach permits the design of codes f o r sophisticated channel constraints.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An implementation of Elias coding for input-restricted channels

An implementation of Elias coding for input-restricted channels is presented and analyzed. This is a variable-to-fixed length coding method that uses finite-precision arithmetic and can work at rates arbitrarily close to channel capacity as the precision is increased. The method offers a favorable tradeoff between complexity and coding efficiency. For example, in experiments with the [2, 71 run...

متن کامل

Arithmetic Coding for Noisy Channels

Arithmetic Coding is generalized to provide a method for transforming source output se quences into sequences whose probability distribution approaches any desired probability distribution. A further modi cation in which gaps are introduced be tween source intervals allows arithmetic encoders to produce code sequences with any information rate, enabling the encoder to perform joint source-cha...

متن کامل

Optimum transform coding of imagery

A system is presented for transform coding of imagery. Specifically, the system uses the 2-D discrete cosine transform (DCT) in conjunction with adaptive classification, entropy-constrained trelliscoded quantization, optimal rate allocation, and adaptive arithmetic encoding. Adaptive classification, side rate reduction, and rate allocation strategies are discussed. Entropy-constrained codebooks...

متن کامل

Comprehensive Analysis on Exact Asymptotics of Random Coding Error Probability

This paper considers error probabilities of random codes for memoryless channels in the fixed-rate regime. Random coding is a fundamental scheme to achieve the channel capacity and many studies have been conducted for the asymptotics of the decoding error probability. Gallager derived the exact asymptotics (that is, a bound with asymptotically vanishing relative error) of the error probability ...

متن کامل

Positive solution of non-square fully Fuzzy linear system of equation in general form using least square method

In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IBM Journal of Research and Development

دوره 27  شماره 

صفحات  -

تاریخ انتشار 1983